'Concerning Cuts'

Some results concerning the ends of minimal cuts of simple graphs

Let S be a cut of a simple connected graph G. If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G − S is called a fragment. And a fragment with no proper subset that is a fragment is called an end. In the paper ends are characterized and it is proved that to a connected graph G = (V, E), the number of its ends Σ ≤ |V (G)|.

Type Two Cuts, Bad Cuts and Very Bad Cuts

Type two cuts, bad cuts and very bad cuts are introduced in [KL] for studying the relationship between Loeb measure and U-topology of a hyper nite time line in an !1-saturated nonstandard universe. The questions concerning the existence of those cuts are asked there. In this paper we answer, fully or partially, some of those questions by showing that: (1) type-two cuts exist, (2) the @1-isomorp...

short cuts

.

Communal Cuts: sharing cuts across images

Identifying objects that are common to a set of images is an important step in unsupervised image analysis. While existing approaches to object extraction and co-segmentation commonly focus merely on joint per-class appearance models, we propose a model that incorporates additional label and boundary co-occurrence information with little additional communication across images. This model admits...

About Folding-Unfolding Cuts and Cuts Modulo